Regenerator Location Problem in Flexible Optical Networks
نویسندگان
چکیده
In this study we introduce the regenerator location problem in flexible optical networks (RLP-FON). With a given traffic demand, RLP-FON tries to solve the regenerator placement, routing, bandwidth allocation and modulation selection problems jointly to satisfy data transfer demands with the minimum number of regenerators. We propose a novel branch and price algorithm for this challenging problem. Using real world network topologies, we conduct extensive numerical experiments to both test the performance of the proposed solution methodology and evaluate the practical benefits of FON. In particular, our results show that making routing, bandwidth allocation, modulation selection and regenerator placement decisions in a joint manner, it is possible to obtain drastic capacity enhancements when only a very modest portion of the nodes is endowed with the signal regeneration capability.
منابع مشابه
The regenerator location problem
In this article, we introduce the regenerator location problem (RLP), which deals with a constraint on the geographical extent of transmission in optical networks. Specifically, an optical signal can only travel a maximum distance of dmax before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is h...
متن کاملHeuristics for the Regenerator Location Problem
Telecommunication systems make use of optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it gets farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive at its intended destination with good quality, it is necessary to regenerate it periodically using regenerators. These components are rel...
متن کاملOn the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters - (Extended Abstract)
We deal with the Regenerator Location Problem in optical networks. We are given a network G = (V,E), and a set Q of communication requests between pairs of terminals in V . We investigate two variations: one in which we are given a routing P of the requests in Q, and one in which we are required to find also the routing. In both cases, each path in P must contain a regenerator after every d edg...
متن کاملRandomized Heuristics for the Regenerator Location Problem
Telecommunication systems make use of optical signals to transmit information. The strength of a signal in an optical network deteriorates and loses power as it gets farther from the source, mainly due to attenuation. Therefore, to enable the signal to arrive at its intended destination with good quality, it is necessary to regenerate it periodically using regenerators. These components are rel...
متن کاملRegenerator Cost Optimization in Path Networks With Traffic Grooming∗
In optical networks regenerators have to be placed on lightpaths in order to regenerate the signal. In addition, grooming enables the use of the same regenerator by several lightpaths. In this work we consider the problem of minimizing the number of regenerators used in traffic grooming in optical networks. We focus on networks with path topology and on the case in which a regenerator has to be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 65 شماره
صفحات -
تاریخ انتشار 2017